package ink.lovejinhu.leetcode;

/**
 * @author jinhu
 * created 2021-07-05 14:27
 */
public class Solution_0006 {
    /**
     * Z 字形变换
     *
     * @param s
     * @param numRows
     * @return
     */
    public String convert(String s, int numRows) {
        char[] source = s.toCharArray();
        int i = s.length() / (numRows + numRows - 2);
        char[][] chars = new char[numRows][i * (numRows - 1)];
        char[][] nizhi = new char[i + (numRows - 1)][numRows];
        int flag = 0;
        int k = 0;
        for (int j = 0; j < nizhi.length; j++) {


        }
        return s;
    }
}
